A Fast Approximate Hypervolume Calculation Method by a Novel Decomposition Strategy
نویسندگان
چکیده
In this paper, we present a new method to fast approximate the hypervolume measurement by improving the classical Monte Carlo sampling method. Hypervolume value can be used as a quality indicator or selection indicator for multiobjective evolutionary algorithms (MOEAs), and thus the efficiency of calculating this measurement is of crucial importance especially in the case of large sets or many dimensional objective spaces. To fast calculate hypervolume, we develop a new Monte Carlo sampling method by decreasing the amount of Monte Carlo sample points using a novel decomposition strategy in this paper. We first analyze the complexity of the proposed algorithm in theory, and then execute a series experiments to further test its efficiency. Both simulation experiments and theoretical analysis verify the effectiveness and efficiency of the proposed method.
منابع مشابه
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with regard to Pareto dominance: whenever a Pareto set approximation entirely dominates another one, then the indicator value of the dominant set will also be better. This property is of high interest and relevance for problems involv...
متن کاملApproximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice
The hypervolume indicator is an increasingly popular set measure to compare the quality of two Pareto sets. The basic ingredient of most hypervolume indicator based optimization algorithms is the calculation of the hypervolume contribution of single solutions regarding a Pareto set. We show that exact calculation of the hypervolume contribution is #P-hard while its approximation is NP-hard. The...
متن کاملFast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملA Hybrid Neural Network Approach for Kinematic Modeling of a Novel 6-UPS Parallel Human-Like Mastication Robot
Introduction we aimed to introduce a 6-universal-prismatic-spherical (UPS) parallel mechanism for the human jaw motion and theoretically evaluate its kinematic problem. We proposed a strategy to provide a fast and accurate solution to the kinematic problem. The proposed strategy could accelerate the process of solution-finding for the direct kinematic problem by reducing the number of required ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017